Evolving sets, mixing and heat kernel bounds
نویسندگان
چکیده
منابع مشابه
Evolving sets, mixing and heat kernel bounds
We show that a new probabilistic technique, recently introduced by the first author, yields the sharpest bounds obtained to date on mixing times of Markov chains in terms of isoperimetric properties of the state space (also known as conductance bounds or Cheeger inequalities). We prove that the bounds for mixing time in total variation obtained by Lovász and Kannan, can be refined to apply to t...
متن کاملDuality and evolving set bounds on mixing times
We sharpen the Evolving set methodology of Morris and Peres and extend it to study convergence in total variation, relative entropy, L2 and other distances. Bounds in terms of a modified form of conductance are given which apply even for walks with no holding probability. These bounds are found to be strictly better than earlier Evolving set bounds, may be substantially better than conductance ...
متن کاملHeat Kernel Bounds, Ancient Κ Solutions and the Poincaré Conjecture
We establish certain Gaussian type upper bound for the heat kernel of the conjugate heat equation associated with 3 dimensional ancient κ solutions to the Ricci flow. As an application, using the W entropy associated with the heat kernel, we give a different and much shorter proof of Perelman’s classification of backward limits of these ancient solutions. The method is partly motivated by [Cx] ...
متن کاملNon ultracontractive heat kernel bounds by Lyapunov conditions
Nash and Sobolev inequalities are known to be equivalent to ultracontractive properties of heat-like Markov semigroups, hence to uniform on-diagonal bounds on their kernel densities. In non ultracontractive settings, such bounds can not hold, and (necessarily weaker, non uniform) bounds on the semigroups can be derived by means of weighted Nash (or super-Poincaré) inequalities. The purpose of t...
متن کاملHeat Kernel Upper Bounds on Long Range Percolation Clusters
In this paper, we derive upper bounds for the heat kernel of the simple random walk on the infinite cluster of a supercritical long range percolation process. For any d ≥ 1 and for any exponent s ∈ (d, (d + 2) ∧ 2d) giving the rate of decay of the percolation process, we show that the return probability decays like t− /s−d up to logarithmic corrections, where t denotes the time the walk is run....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Probability Theory and Related Fields
سال: 2005
ISSN: 0178-8051,1432-2064
DOI: 10.1007/s00440-005-0434-7